A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost

The most popular algorithms for generation of minimal spanning tree are Kruskal’s[2] and Prim’s[2] algorithm. Many algorithms have been proposed for generation of all spanning tree. This paper deals with generation of all possible spanning trees in increasing cost of a weighted graph. This approach uses one matrix called Difference Weighted Circuit Matrix (DWCM); it is little bit modification of FCM. KeywordsWeighted Graph, Spanning tree, MST, DWCM, Cord.